A type (1,1,1) face-magic labeling of a planar graph G = (V, E,F) is a bijection from V ,E ,F to the set of labels {1,2, …, , |V|+ |E| + |F|} such that the weight of every n-sided face of G is equal to the same _xed constant. The weight of a face Ƒ,,F is equal to the sum of the labels of the vertices, edges, and face that determine Ƒ, . It is known that the grid graph Pm_Pn admits a type (1,1,1) face-magic labeling, but the proof in the literature is quite lengthy. We give a simple proof of this result and show two more in_nite families of gridded graphs admit type (1,1,1) face-magic labelings.